package src.leetcode.dp.medium_0122;

public class maxProfit {
    public static void main(String[] args) {
        Solution solution = new Solution();
        System.out.println(solution.maxProfit(new int[]{1,2,3,4,5}));
    }
}


class Solution {
    public int maxProfit(int[] prices) {
        int [][]dp = new int[prices.length][2];
        dp[0][1] = -prices[0];
        for (int i = 1; i < prices.length; i++) {
            dp[i][0] = Math.max(dp[i - 1][0], dp[i - 1][1]+prices[i]);
            dp[i][1] = Math.max(dp[i - 1][1], dp[i - 1][0]-prices[i]);
        }

        return dp[prices.length-1][0];
    }
}

